Symbolic analysis via semantic reinterpretation

Analysis via Symbolic Executions

Analysis via Symbolic Executions

Relaxing Underspecified Semantic Representations for Reinterpretation

Type and sort connicts in semantics are usually resolved by a process of reinterpretation. Recently, Egg (1999) has proposed an alternative account in which connicts are avoided by underspeciication. The main idea is to derive suuciently relaxed underspeciied semantic representations ; addition of reinterpretation operators then simply is further specialization. But in principle, relaxing under...

Relaxing Underspeci ed Semantic Representations for Reinterpretation

Precise Cache Timing Analysis via Symbolic Simulation

Worst-Case Execution Time (WCET) is a reliable guarantee for the temporal correctness of hard real-time systems. In this paper, we propose a novel integrated method for WCET analysis where micro-architectural modeling – with emphasis on caches – and systematic path-sensitivity, are synergized. This would give us very high precision for WCET analysis, but at the same time, it is a huge challenge...

Bucketing Failing Tests via Symbolic Analysis

A common problem encountered while debugging programs is the overwhelming number of test cases generated by automated test generation tools, where many of the tests are likely to fail due to same bug. Some coarse-grained clustering techniques based on point of failure (PFB) and stack hash (CSB) have been proposed to address the problem. In this work, we propose a new symbolic analysis-based clu...